Climbing Up NP-Hard Hills

Evolutionary algorithms are sophisticated hill-climbers. In this paper, we discuss the ability of this class of local search algorithms to provide useful and eecient heuristics to solve NP-hard problems. Our discussion is illustrated on experiments aiming at solving the job-shop-scheduling problem. We focus on the components of the EA, pointing out the importance of the objective function as well as the manner the operators are applied. Experiments clearly show the eeciency of local search methods in this context , the trade-oo between \pure" and hybrid algorithms, as well as the very good performance obtained by simple hill-climbing algorithms. This work has to be regarded as a step towards a better understanding of the way search algorithms wander in a tness landscape.